Revising Writer-based Prose

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grapheme Based Writer Verification

In this communication we propose an approach for the writer verification task. The difficulty of this task lies first, in the decision making between the two assumptions which model the problem: "Do the two writings come from the same writer ?" or "Do the two writings come from different writers?" and second, in the evaluation of the error risk associated to this decision. We have called upon a...

متن کامل

PROSE: A Plugin-Based Paraconsistent OWL Reasoner

The study of paraconsistent reasoning with ontologies is especially important for the Semantic Web since knowledge is not always perfect within it. Quasi-classical semantics is proven to rationally draw more meaningful conclusions even from an inconsistent ontology with the stronger inference power of paraconsistent reasoning. In our previous work, we have conceived a quasi-classical framework ...

متن کامل

Information Retrieval Based Writer Identification

In this paper, we apply an Information Retrieval model for the writer identification task. A set of local features is defined by clustering the graphemes produced by a segmentation procedure. Then a textual based Information Retrieval model is applied. After a first indexation step, this model no longuer requires image access to the database for responding to a specific query, thus making the p...

متن کامل

On Revising Argumentation-Based Decision Systems

Decision making amounts to define a preorder (usually a complete one) on a set of options. Argumentation has been introduced in decision making analysis. In particular, an argument-based decision system has been proposed recently by Amgoud et al. The system is a variant of Dung’s abstract framework. It takes as input a set of options, different arguments and a defeat relation among them, and re...

متن کامل

Counterfactual Reasoning Based on Revising Assumptions

We present a semantics for counterfactual implication relative to positive programs with integrity constraints and protected rules (unrevisable). A counterfactual truth evaluation is presented based on Contradiction Removal Semantics. We show the adequacy of C RS to deene the notion of similarity needed for deening counterfactual truth. The concepts introduced by C RS are adequate to support th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Basic Writing

سال: 1981

ISSN: 0147-1635

DOI: 10.37514/jbw-j.1981.3.3.07